MGA trajectory planning with an ACO-inspired algorithm
نویسندگان
چکیده
منابع مشابه
MGA trajectory planning with an ACO-inspired algorithm
Given a set of celestial bodies, the problem of finding an optimal sequence of swing-bys, deep space manoeuvres (DSM) and transfer arcs connecting the elements of the set is combinatorial in nature. The number of possible paths grows exponentially with the number of celestial bodies. Therefore, the design of an optimal multiple gravity assist (MGA) trajectory is a NP-hard mixed combinatorial-co...
متن کاملSolving Path Planning Problem by an ACO-PSO Hybrid Algorithm
An ACO-PSO Hybrid Algorithm Solving Path Planning Problem based on Swarm Intelligence (SI) is proposed. The problem first is described and some corresponding definitions are presented. Ant colony optimization (ACO) is used to establish the corresponding solution, and some material algorithm steps are set out. Particle swarm optimization (PSO) is applied to optimize the parameters in ACO, and pa...
متن کاملOptimal Planning with ACO
In this paper a planning framework based on Ant Colony Optimization techniques is presented. Optimal planning is a very hard computational problem which has been coped with different methodologies. Approximate methods do not guarantee either optimality or completeness, but it has been proved that in many applications they are able to find very good, often optimal, solutions. We propose several ...
متن کاملReview of Bio-inspired Algorithm in Wireless Sensor Network: ACO, ACO using RSSI and Ant Clustering
Biological inspired routing or bio-inspired routing is a new heuristic routing algorithm in wireless sensor network, which is inspired from biological activities of insects. ACO is ants’ inspired routing algorithm ACO, which has the ability to find shortest path and re-establish the new route in the case of route failure. In order to improve the network performance i.e. increase network lifetim...
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Astronautica
سال: 2010
ISSN: 0094-5765
DOI: 10.1016/j.actaastro.2010.07.001